Scheduling School Meetings
نویسندگان
چکیده
Prespecified meetings between teachers and parents have to be scheduled. All meetings have the same duration. The goal is in finding a schedule minimizing the total time and the parents’ idle times. This NP-hard problem is addressed by solving first a sequence of weighted assignment problems and then performing a large scale neighborhood search based on finding negative cost cycles and shortest paths in directed graphs. This approach provides good computational results. Finally a variant of the problem with two different durations for the meetings is considered.
منابع مشابه
Learning Dynamic Time Preferences in Multi-Agent Meeting Scheduling
In many organizations, people are faced with the task of scheduling meetings subject to conflicting time constraints and preferences. We are working towards multi-agent scheduling systems in which each person has an agent that negotiates with other agents to schedule meetings. Such agents need to model the scheduling preferences of their users in order to make effective scheduling decisions. We...
متن کاملA Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a number of different versions of the timetabling problem. These include school timetabling (where students are grouped in classes with similar degree plans), university timetabling (where students are considered individu...
متن کاملA Formal Study of Distributed Meeting Scheduling
Automating routine organizational tasks, such as meeting scheduling, requires a careful balance between the individual (respecting his or her privacy and personal preferences) and the organization (making efficient use of time and other resources). We argue that meeting scheduling is an inherently distributed process, and that negotiating over meetings can be viewed as a distributed search proc...
متن کاملScheduling Meetings by Agents
The Scheduling of Meetings of multiple users is a real world problem that was studied intensively in recent years. The present paper proposes a realistic model for representing and solving meetings scheduling problems (MSPs) and the use of constraints optimization algorithms to solve MSPs. A central component of the proposed model of MSPs is a mechanism to balance the trade-off between competit...
متن کاملFramework of Meeting Scheduling in Computer Systems
Development of computer technologies is a necessary but not the only precondition for solving problems by means of computer supported cooperative work (CSCW). The proposed framework for meeting scheduling encompasses parameters of group members, jobs they carry out, meetings as well as scheduling procedures. In addition to knowledge and experience required for the usage of today’s powerful comp...
متن کامل